Session C 3 . 1 12 th Canadian Conference on Computational Geometry Computing Cut Numbers

C 5 . 2 12 th Canadian Conference on Computational Geometry The Area Partitioning

15 Session C4 12th Canadian Conference on Computational Geometry

Session C6.2 12th Canadian Conference on Computational Geometry

Open Problems from CCCG 2014

This report provides the problems posed by the participants at the open problem session of the 26 Canadian Conference on Computational Geometry. This well-attended session was held Tuesday, August 12, 2014, as a scheduled session of the conference. Six participants presented a total of seven problems. All presenters kindly agreed to provide written versions of their problems, including referenc...

K-Guarding Polygons on the Plane

Let P be a simple polygon with n vertices. We say that P is k-guardable if it is possible to find a set of points Q consisting of interior points of edges of P such that every point of P is visible from at least k elements in Q and no edge of P has more than one element in Q. The following question was asked by A. Lubiw at the open problem session of the Fourth Canadian Conference in Computatio...